Decoding a Class of Alternant Codes for the Lee Metric
نویسنده
چکیده
Following are the abstracts of contributions (i.e., talks and posters) to the 13th Annual Meeting of the IMS held at the National University of Ireland Maynooth, 6–8 September 2000. The abbreviations after the names designate: ‘M’ for main speaker, ‘S’ for speaker, ‘RS’ for research student, and ‘P’ for poster. The abstracts are included as provided by the contributors for this volume of the Bulletin, edited by the editor if deemed necessary. Harmonic Maps in Unfashionable Geometries F.E. Burstall, University of Bath (M) Many special surfaces in classical differential geometry are characterised by the property that an appropriate Gauss map is harmonic and then the integrable features of their geometry (spectral deformation, Bäcklund transformation, algebro-geometric solutions and so on) can be inferred from those of harmonic maps. Thus a special case of the Ruh–Vilms theorem asserts that a surface has constant mean curvature if and only if its Gauss map is a harmonic map into the 2-sphere and, similarly, a surface has constant negative Gauss curvature if and only if its Gauss map is Lorentz harmonic with respect to the metric induced on the surface by the second fundamental form. It is interesting that harmonic maps into pseudo-Riemannian symmetric spaces also arise in this context: a surface in S is Willmore if and only if its conformal Gauss map is harmonic. This is a map into the indefinite Grassmannian that parametrises 2-spheres in S and geometrically represents a congruence of 2-spheres having partial second order contact with the Willmore surface. In this talk I report on work in progress with Udo Hertrich-Jeromin and show that similar constructions are available in Lie sphere and projective differential geometry. Moreover, both geometries can be
منابع مشابه
Alternant and BCH codes over certain rings
Alternant codes over arbitrary finite commutative local rings with identity are constructed in terms of parity-check matrices. The derivation is based on the factorization of xs − 1 over the unit group of an appropriate extension of the finite ring. An efficient decoding procedure which makes use of the modified Berlekamp-Massey algorithm to correct errors and erasures is presented. Furthermore...
متن کاملInterpolation-based Decoding of Alternant Codes
We formulate the classical decoding algorithm of alternant codes afresh based on interpolation as in Sudan’s list decoding of Reed-Solomon codes, and thus get rid of the key equation and the linear recurring sequences in the theory. The result is a streamlined exposition of the decoding algorithm using a bit of the theory of Gröbner bases of modules.
متن کاملOn PGZ decoding of alternant codes
In this note we first review the classical Petterson-Gorenstein-Zierler decoding algorithm for the class of alternant codes (which includes Reed-Solomon, Bose-Chaudhuri-Hocquenghem and classical Goppa codes), then we present an improvement of the method to find the number of errors and the errorlocator polynomial, and finally we illustrate the procedure with several examples. In two appendices ...
متن کاملDecoding Procedure for BCH, Alternant and Goppa Codes defined over Semigroup Ring
In this paper we present a decoding principle for BCH, Alternant and Goppa codes constructed through a semigroup ring, which is based on modified Berlekamp-Massey algorithm. This algorithm corrects all errors up to the Hamming weight t ≤ r, i.e., whose minimum Hamming distance is 2r + 1. Key-word: Semigroup rings, BCH codes, Alternant codes, Goppa codes, modified BerlekampMassey algorithm.
متن کاملOn the Key Equation Over a Commutative Ring
We define alternant codes over a commutative ring R and a corresponding key equation. We show that when the ring is a domain, e.g. the p-adic integers, the error–locator polynomial is the unique monic minimal polynomial (shortest linear recurrence) of the syndrome sequence and that it can be obtained by Algorithm MR of Norton. When R is a local ring, we show that the syndrome sequence may have ...
متن کاملImproved decoding of Reed-Solomon and algebraic-geometry codes
Given an error-correcting code over strings of length n and an arbitrary input string also of length n, the list decoding problem is that of finding all codewords within a specified Hamming distance from the input string. We present an improved list decoding algorithm for decoding Reed-Solomon codes. The list decoding problem for Reed-Solomon codes reduces to the following “curve-fitting” probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 6 شماره
صفحات -
تاریخ انتشار 2001